A Fast Heuristic Method for Polynomial Moment Problems with Boltzmann–Shannon Entropy

A FAST GA-BASED METHOD FOR SOLVING TRUSS OPTIMIZATION PROBLEMS

Due to the complex structural issues and increasing number of design variables, a rather fast optimization algorithm to lead to a global swift convergence history without multiple attempts may be of major concern. Genetic Algorithm (GA) includes random numerical technique that is inspired by nature and is used to solve optimization problems. In this study, a novel GA method based on self-a...

A FAST FUZZY-TUNED MULTI-OBJECTIVE OPTIMIZATION FOR SIZING PROBLEMS

The most recent approaches of multi-objective optimization constitute application of meta-heuristic algorithms for which, parameter tuning is still a challenge. The present work hybridizes swarm intelligence with fuzzy operators to extend crisp values of the main control parameters into especial fuzzy sets that are constructed based on a number of prescribed facts. Such parameter-less particle ...

Simulated annealing: a fast heuristic for some generic layout problems

There are two major criticisms about simulated annealing as a general method for solving combinatorial optimization problems: its effectiveness when compared with other welldesigned heuristics and its excessive computation time. In this paper, we show that simulated annealing, with properly des~gned annealing schedule and move generation strategy, achieves significant speerlups for high quality...

Maximum Entropy method with non-linear moment constraints: challenges

Traditionally, the Method of (Shannon-Kullback’s) Relative Entropy Maximization (REM) is considered with linear moment constraints. In this work, the method is studied under frequency moment constraints which are non-linear in probabilities. The constraints challenge some justifications of REM since a) axiomatic systems are developed for classical linear moment constraints, b) the feasible set ...

A Heuristic for Moment-Matching Scenario Generation